The Lattice of Concept Graphs of a Relationally Scaled Context
نویسندگان
چکیده
The aim of this paper is to contribute to Data Analysis by clarifying how concept graphs may be derived from data tables. First it is shown how, by the method of relational scaling, a many-valued data context can be transformed into a power context family. Then it is proved that the concept graphs of a power context family form a lattice which can be described as a subdirect product of speciic intervals of the concept lattices of the power context family (each extended by a new top-element). How this may become practical is demonstrated using a data table about the domestic ights in Austria. Finally, the lattice of syntactic concept graphs over an alphabet of object, concept, and relation names is determined and related to the lattices of concept graphs of the power context families which are semantic models of the given contextual syntax.
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملExtended graphs based on KM-fuzzy metric spaces
This paper, applies the concept of KM-fuzzy metric spaces and introduces a novel concept of KM-fuzzy metric graphs based on KM-fuzzy metric spaces. This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to extend the concept of KM-fuzzy metric spaces to a larger ...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملLattices of Triadic Concept Graphs
Triadic concept graphs have been introduced as a mathema-tization of conceptual graphs with subdivision. In this paper it is shown that triadic concept graphs of a triadic power context family always form a complete lattice with respect to the generalization order. For stating this result, a clariication of the notion of generalization is needed. It turns out that the generalization order may b...
متن کامل